Stable matching : Theory , evidence , and practical design
نویسنده
چکیده
This year’s Prize to Lloyd Shapley and Alvin Roth extends from abstract theory developed in the 1960s, over empirical work in the 1980s, to ongoing efforts to find practical solutions to real-world problems. Examples include the assignment of new doctors to hospitals, students to schools, and human organs for transplant to recipients. Lloyd Shapley made the early theoretical contributions, which were unexpectedly adopted two decades later when Alvin Roth investigated the market for U.S. doctors. His findings generated further analytical developments, as well as practical design of market institutions.
منابع مشابه
A Proposed Mechanism for the Iranian Model of Kidney Donation (A Comparison of the Iranian and Roth’s Models)
Optimal resource allocation by means of the price mechanism is one of the main duties of the economics. Optimum allocation is sometimes realized not through the price mechanism, but via assignment algorithms due to an insufficient number of agents on either side of the exchange. Facing the same problem, the kidney market may be considered as a type of market failure that calls for market design...
متن کاملRecent Developments in Matching Theory and Its Practical Applications
In recent years, many developments have been made in matching theory and its applications to market design. This paper surveys them and suggests possible research directions. The main focus is on the advances in matching theory that try to solve market design problems in practical markets where the classic theory is inapplicable. Specifically, we discuss the recent theory of matching in large m...
متن کاملSoft Constraints in Stable Matching Problems
The stable matching problem has many practical applications in two-sided markets, like those that assign doctors to hospitals, students to schools, or buyers to vendors. Usually it is assumed that the participants of one side explicitly express a preference ordering over all those on the other side. This can be unfeasible when the number of options is large or has a combinatorial structure. We ...
متن کاملMATCH-UP: Matching Under Preferences – Algorithms and Complexity Satellite workshop of ICALP 2008 Further background information
Many practical situations give rise to large-scale matching problems involving sets of participants – for example pupils and schools, school-leavers and universities, applicants and positions – where some or all of the participants express preferences over the others. A large class of matching problems that involve preferences is the class of stable matching problems. Such problems involve a se...
متن کاملSpecialised Constraints for Stable Matching Problems
The stable marriage problem (SM) and the Hospital / Residents problem (HR) are both stable matching problems. They consist of two sets of objects that need to be matched to each other; in SM men to women, and in HR residents to hospitals. Each set of objects expresses a ranked preference for the objects in the other set, in the form of a preference list. The problem is then to find a matching o...
متن کامل